Interaction of JVM with x86, Sparc and MIPS
نویسندگان
چکیده
A Java class is a perfect example of architecture independent code. A Java program can be compiled on a MIPS R4400 based Indy workstation running Irix 6.5 and the generated class executed on an Intel Pentium III based Windows 95 system with no problems. This independence is possible, because any system claiming to support Java implements a Java Virtual Machine (JVM). This paper presents a detailed analysis of the interaction of a JVM with three popular processor architectures – the Intel x86, the Sun UltraSparc and the SGI MIPS. The analysis shows that each architecture performs better than the other two in some aspects, but no one architecture is the “best” for Java programs.
منابع مشابه
QEMU, a Fast and Portable Dynamic Translator
We present the internals of QEMU, a fast machine emulator using an original portable dynamic translator. It emulates several CPUs (x86, PowerPC, ARM and Sparc) on several hosts (x86, PowerPC, ARM, Sparc, Alpha and MIPS). QEMU supports full system emulation in which a complete and unmodified operating system is run in a virtual machine and Linux user mode emulation where a Linux process compiled...
متن کاملMicroprocessor Standards and Markets , Part 11 : Six Architectural Affiliations
Each of the dominant chip architectures has affiliations with a variety of industry playersfrom chip fabricators to platform vendors. The strength of these affiliations, or keiretsus, will play a key role in determining the general market acceptance of a chip architecture. Intel X86 is the strongest keiretsu based on its immense application availability, volume, and range of products. The Power...
متن کاملOne-Pass, Optimal Tree Parsing - With Or Without Trees
This paper describes the theory behind and implementation of wburg, a code-generator generator that accepts tree grammars as input and produces a code generator that emits an optimal parse of an IR tree in just a single bottom-up pass. Furthermore, wburg eliminates the need for an explicit IR tree altogether. The grammars that wburg-generated parsers can parse are a proper subset of those that ...
متن کاملAliased Register Allocation for Straight-Line Programs Is NP-Complete
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of registers is homogeneous. In this paper we study registers which may alias: an aliased register can be used both independently or in combination with an adjacent register. Such registers are found in commonly-used architect...
متن کاملPathlengths of SPEC Benchmarks for PA-RISC, MIPS, and SPARC
The total instruction pathlength and instruction frequency counts are measured for the SPEC89 benchmark programs on the PA-RISC architecture and compared with previously published information for the MIPS and SPARC architectures. The PA-RISC architecture typically requires significantly fewer instructions than the other two architectures for the same benchmark. The differences in counts for ins...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000